Addendum to “ Maximal Chains In
نویسندگان
چکیده
This note is intended as a supplement and clarification to the proof of Theorem 3.3 of [1]; namely, it is consistent that b = ℵ 1 yet for every ultrafilter U on ω there is a ≤ * chain {f ξ : ξ ∈ ω 2 } such that {f ξ /U : ξ ∈ ω 2 } is cofinal in ω/U. The general outline of the the proof remains the same. In other words, a ground model is taken which satisfies 2 ℵ0 = ℵ 1 and in which there is a ♦ ω2 sequence {D ξ : ξ ∈ ω 2 } such that for every X ⊆ ω 2 there is a stationary set of ordinals, µ, such that cof(µ) = ω 1 and such that X ∩ µ = D µ. Actually, a coding will be used to associate with subsets of ω 2 , names for subsets on ω in certain partial orders. The details of this coding will be ignored except to state that c(D η) will denote the coded set and that if P ω2 = lim{P ξ : ξ ∈ ω 2 } is the finite support iteration of ccc partial orders of size no greater than ω 1 and 1 Pω 2 " X ⊆ [ω] ℵ 0 " then there is a stationary set S X ⊆ ω 2 , consisting of ordinals of uncountable cofinality, such that 1 P ξ " X ↾ P ξ = c(D ξ) " for each ξ ∈ S X. Here X ↾ P ξ denotes the P ξ-name obtained by considering only those parts of X that mention conditions in P ξ ; to be more precise here would requires providing the details of a specific development of names in the theory of forcing, and so this will not be done.
منابع مشابه
The number of maximal matchings in polyphenylene chains
A matching is maximal if no other matching contains it as a proper subset. Maximal matchings model phenomena across many disciplines, including applications within chemistry. In this paper, we study maximal matchings in an important class of chemical compounds: polyphenylenes. In particular, we determine the extremal polyphenylene chains in regards to the number of maximal matchings. We also de...
متن کاملFuzzy Subgroups of Rank Two Abelian p-Group
In this paper we enumerate fuzzy subgroups, up to a natural equivalence, of some finite abelian p-groups of rank two where p is any prime number. After obtaining the number of maximal chains of subgroups, we count fuzzy subgroups using inductive arguments. The number of such fuzzy subgroups forms a polynomial in p with pleasing combinatorial coefficients. By exploiting the order, we label the s...
متن کاملAddendum to "trees in random graphs"
The aim of this addendum is to explain more precisely the second part of the proof of Theorem 1 from our paper [1] . We need to show that a.e. graph G E lfi(n, p) contains a maximal induced tree of order less than (1+6)x (log n)/(log d) . The second moment method used in our Lemma shows in fact that Prob{0 .9 E(X,) < X, < 1 .1 E(X,)} = 1-o(1) . (1') Now let S, stand for the number of (1, r)-sta...
متن کاملInfluence of Addendum Modification Factor on Root Stresses in Normal Contact Ratio Asymmetric Spur Gears
Tooth root crack is considered as one of the crucial causes of failure in the gearing system and it occurs at the tooth root due to an excessive bending stress developed in the root region. The modern power transmission gear drives demand high bending load capacity, increased contact load capacity, low weight, reduced noise and longer life. These subsequent conditions are satisfied by the aid o...
متن کاملCLASSIFYING FUZZY SUBGROUPS OF FINITE NONABELIAN GROUPS
In this paper a rst step in classifying the fuzzy subgroups of a nite nonabelian group is made. We develop a general method to count the number of distinct fuzzy subgroups of such groups. Explicit formulas are obtained in the particular case of dihedral groups.
متن کامل